Multiple-query optimization

Multiple Range Query Optimization

In order to answer efficiently range queries in 2-d R-trees, first we sort queries by means of a space filling curve, then we group them together, and finally pass them for processing. Initially, we consider grouping of pairs of requests only, and give two algorithms with exponential and linear complexity. Then, we generalize the linear method, grouping more than two requests per group. We eval...

Multiple Query Optimization by Ca he - AwareMiddleware using Query

Multiple query optimization in middleware using query teamwork

Multiple concurrent queries occur in many database settings. This paper describes the use of middleware as an optimization tool for such queries. Since common subexpressions derive from common data and the data is usually greatest at the source, the middleware exploits the presence of sharable access patterns to underlying data, especially scans of large portions of tables or indexes, in enviro...

Multiple Query Optimization by Cache-Aware Middleware Using Query Teamwork

Queries with common sequences of disk accesses can make maximal use of a buffer pool. We developed a middleware to promote the necessary conditions in concurrent query streams, and achieved a speedup of 2.99 in executing a workload derived from the TCP-H benchmark.

Multiple Query Optimization in Mediator Systems

With the increase in mediated applications, there are now mediated application servers that support concurrent client accesses. Multiple query optimization (MQO) is essential for efficient processing of concurrent read only queries. The MQO problem in mediated environments differs from that of ordinary relational MQO systems in two ways: first, in mediated environments, the MQO system must be c...